introduction to the theory of computationの例文

例文

1. The following discussion is based on Michael Sipser's textbook " Introduction to the Theory of Computation ".
2. Turing machine " are totally equivalent, and the proof can be found in many textbooks, for example Sipser's " Introduction to the Theory of Computation ", section 7.3 . ).
3. The book consists of ten chapters, and deals with the topics of searching, sorting, basic graph algorithms, string processing, the fundamentals of cryptography and data compression, and an introduction to the theory of computation.
4. As Michael Sipser points out in " Introduction to the Theory of Computation " : " The reduction must be easy, relative to the complexity of typical problems in the class [ . . . ] If the reduction itself were difficult to compute, an easy solution to the complete problem wouldn't necessarily yield an easy solution to the problems reducing to it ."